Garside monoids vs divisibility monoids
نویسنده
چکیده
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter type). Here, we show that the quasi-center of these monoids can be studied and described similarly, and then we exhibit the intersection between the two classes of monoids.
منابع مشابه
Automatic semigroups vs automaton semigroups
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...
متن کاملDivisibility Monoids: Presentation, Word Problem, and Rational Languages
We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We give a decidable class of presentations that gives rise precisely to all divisibility monoids. (2) We show that any divisibility monoid is an automatic monoid [5]. This implies that its word problem is solvable in quadratic tim...
متن کاملFinite transducers for divisibility monoids
Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to c...
متن کاملAlternating Normal Forms for Braids and Locally Garside Monoids
We describe new types of normal forms for braid monoids, Artin– Tits monoids, and, more generally, all monoids in which divisibility has some convenient lattice properties (“locally Garside monoids”). We show that, in the case of braids, one of these normal forms turns out to coincide with the normal form introduced by Burckel and deduce that the latter can be computed easily. This approach lea...
متن کاملOn Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2005